Differential approximation of NP-hard problems with equal size feasible solutions
نویسندگان
چکیده
منابع مشابه
Differential approximation of NP-hard problems with equal size feasible solutions
In this paper, we focus on some specific optimization problems from graph theory, those for which all feasible solutions have an equal size that depends on the instance size. Once having provided a formal definition of this class of problems, we try to extract some of its basic properties; most of these are deduced from the equivalence, under differential approximation, between two versions of ...
متن کاملApproximation algorithms for NP-hard optimization problems
In this chapter, we discuss approximation algorithms for optimization problems. An optimization problem consists in finding the best (cheapest, heaviest, etc.) element in a large set P, called the feasible region and usually specified implicitly, where the quality of elements of the set are evaluated using a function f(x), the objective function, usually something fairly simple. The element tha...
متن کاملTypical Performance of Approximation Algorithms for NP-hard Problems
Typical performance of approximation algorithms is studied for randomized minimum vertex cover problems. A wide class of random graph ensembles characterized by an arbitrary degree distribution is discussed with the presentation of a theoretical framework. Herein, three approximation algorithms are examined: linearprogramming relaxation, loopy-belief propagation, and a leaf-removal algorithm. T...
متن کاملApproximation Hardness for Small Occurrence Instances of NP-Hard Problems
The paper contributes to the systematic study (started by Berman and Karpinski) of explicit approximability lower bounds for small occurrence optimization problems. We present parametrized reductions for some packing and covering problems, including 3-Dimensional Matching, and prove the best known inapproximability results even for highly restricted versions of them. For example, we show that i...
متن کاملLec . 1 : Approximation Algorithms for NP - hard problems
In this course, we will be studying, as the title suggests, the approximability and inapproximability (limits of approximability) of different combinatorial optimization problems. All the problems we will be looking at will be ones that lack efficient algorithms and in particular will be NP-hard problems. The last two-three decades has seen remarkable progress in approximation algorithms for se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Operations Research
سال: 2002
ISSN: 0399-0559,1290-3868
DOI: 10.1051/ro:2003008